Zhuang-Zi: A New Algorithm for Solving Multivariate Polynomial Equations over a Finite Field

نویسندگان

  • Jintai Ding
  • Jason E. Gower
  • Dieter Schmidt
چکیده

We present the Zhuang-Zi algorithm, a new method for solving multivariate polynomial equations over a finite field. We describe the algorithm and present examples, some of which cannot be solved with the fastest known algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithm for Solving Massively Underdefined Systems of Multivariate Quadratic Equations over Finite Fields

Multivariate Quadratic Equations over Finite Fields Heliang Huang, Wansu Bao* Zhengzhou Information Science and Technology Institute, Zhengzhou 450000, China ABSTRACT Solving systems of m multivariate quadratic equations in n variables (MQ-problem) over finite fields is NP-hard. The security of many cryptographic systems is based on this problem. Up to now, the best algorithm for solving the un...

متن کامل

A New Efficient Algorithm for Solving Systems of Multivariate Polynomial Equations

The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. The classical algorithm for solving such a system is Buchberger’s algorithm for constructing Gröbner bases. Another algorithm for solving such a system is XL algorithm. For sparse system, Buchberger’s algorithm benefits from sparsity of the sys...

متن کامل

Finding Roots in GF(pn) with the Successive Resultant Algorithm

The problem of solving polynomial equations over finite fields has many applications in cryptography and coding theory. In this paper, we consider polynomial equations over a “large” finite field with a “small” characteristic. We introduce a new algorithm for solving this type of equations, called the Successive Resultants Algorithm (SRA) in the sequel. SRA is radically different from previous ...

متن کامل

Solving Underdefined Systems of Multivariate Quadratic Equations

The security of several recent digital signature schemes is based on the difficulty of solving large systems of quadratic multivariate polynomial equations over a finite field F. This problem, sometimes called MQ, is known to be NP-hard. When the number m of equations is equal to the number n of variables, and if n < 15, Gröbner base algorithms have been applied to solve MQ. In the overdefined ...

متن کامل

Finite difference method for solving partial integro-differential equations

In this paper, we have introduced a new method for solving a class of the partial integro-differential equation with the singular kernel by using the finite difference method. First, we employing an algorithm for solving the problem based on the Crank-Nicholson scheme with given conditions. Furthermore, we discrete the singular integral for solving of the problem. Also, the numerical results ob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2006  شماره 

صفحات  -

تاریخ انتشار 2006